Binomial distribution of railway superstructure elements
نویسندگان
چکیده
Statistical methods of control point components and quality products are an integral part modern production, their application is closely connected with solving tasks increasing labour productivity general enterprise culture, saving materials, reducing defects. The paper presents a derivation basic formulas for binomial distribution elements the railway track superstructure. Calculation theoretical made. interrelation between probability theory, statistics, considered.
منابع مشابه
Optimization of Double Track Railway Bridge Superstructure Using FEM
The purpose of this paper is to optimize truss bridges with a span of 50 m and 60 m long at different heights while they are subjected to wind and railway loading. Later the bridges are compared according to the most important analysis outcome such as deflection in order to identify the optimum bridge height. The analysis and design of double track bridge for modified broad gauge loading is don...
متن کاملInvestigation of the Influences of Track Superstructure Parameters on Ballasted Railway Track Design
The main design criteria of ballasted railway tracks include rail deflections, rail bending stresses, rail wheel contact stresses, sleeper bending moments and ballast sleeper contact pressures. Numerous criteria have been defined for the design of ballasted railway tracks owing to the various mechanical properties of track components and their complex interaction. Therefore, railway track desig...
متن کاملBinomial Sampling and the Binomial Distribution
This is a good place to point out that these are only (approximating) , and not full truth. models Truth is not a model. A model, by definition, is an approximation (and not truth). In fact, out of a few million coin flips, one or more coins will remain standing on edge – that is truth. The binomial model does not allow such reality. The idea is more easily understood for the outcomes “dead" or...
متن کاملDistribution-Sensitive Binomial Queues
A new priority queue structure is introduced, for which the amortized time to insert a new element isO(1) while that for the minimumextraction is O(logK). K is the average, taken over all the deleted elements x, of the number of elements that are inserted during the lifespan of x and are still in the heap when x is removed. Several applications of our structure are mentioned.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: E3S web of conferences
سال: 2023
ISSN: ['2555-0403', '2267-1242']
DOI: https://doi.org/10.1051/e3sconf/202340206013